Intelligent Reflecting Surface Enabled Sensing: Cramér-Rao Bound Optimization

نویسندگان

چکیده

This paper investigates intelligent reflecting surface (IRS) enabled non-line-of-sight (NLoS) wireless sensing, in which an IRS is dedicatedly deployed to assist access point (AP) sense a target at its NLoS region. It assumed that the AP equipped with multiple antennas and uniform linear array. We consider two types of models, namely extended targets, for aims estimate target's direction-of-arrival (DoA) response matrix respect IRS, respectively, based on echo signals from AP-IRS-target-IRS-AP link. Under this setup, we jointly design transmit beamforming reflective minimize Cram\'er-Rao bound (CRB) estimation error. Towards end, first obtain CRB expressions models closed form. shown case, estimating DoA depends both beamformers; while only beamformers. Next, optimize joint CRB, via alternating optimization, semi-definite relaxation, successive convex approximation. For optimal solution Finally, numerical results show cases, proposed designs minimization achieve improved sensing performance terms mean squared error, as compared other traditional schemes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coarrays, MUSIC, and the Cramér-Rao Bound

Sparse linear arrays, such as co-prime arrays and nested arrays, have the attractive capability of providing enhanced degrees of freedom. By exploiting the coarray structure, an augmented sample covariance matrix can be constructed and MUSIC (MUtiple SIgnal Classification) can be applied to identify more sources than the number of sensors. While such a MUSIC algorithm works quite well, its perf...

متن کامل

Cramér-Rao bound for range estimation

In this paper, we derive the Cramér-Rao bound (CRB) for range estimation, which does not only exploit the range information in the time delay, but also in the amplitude of the received signal. This new bound is lower than the conventional CRB that only makes use of the range information in the time delay. We investigate the new bound in an additive white Gaussian noise (AWGN) channel with atten...

متن کامل

Bayesian Cramér-Rao Bound for Noisy Non-Blind and Blind Compressed Sensing

In this paper, we address the theoretical limitations in reconstructing sparse signals (in a known complete basis) using compressed sensing framework. We also divide the CS to non-blind and blind cases. Then, we compute the Bayesian Cramer-Rao bound for estimating the sparse coefficients while the measurement matrix elements are independent zero mean random variables. Simulation results show a ...

متن کامل

MSE Bounds With Affine Bias Dominating the CramÉr-Rao Bound

In continuation to an earlier work, we further develop bounds on the mean-squared error (MSE) when estimating a deterministic parameter vector 0 in a given estimation problem, as well as estimators that achieve the optimal performance. The traditional Cramér–Rao (CR) type bounds provide benchmarks on the variance of any estimator of 0 under suitable regularity conditions, while requiring a prio...

متن کامل

Asymptotic Cramér-Rao Bound for Noise-Compensated Autoregressive Analysis

Noise-compensated autoregressive (AR) analysis is a problem insufficiently explored with regard to the accuracy of the estimate. This paper studies comprehensively the lower limit of the estimation variance, presenting the asymptotic Cramér– Rao bound (CRB) for Gaussian processes and additive Gaussian noise. This novel result is obtained by using a frequency-domain perspective of the problem as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2023

ISSN: ['1053-587X', '1941-0476']

DOI: https://doi.org/10.1109/tsp.2023.3280715